#include "insertion-sort.h"

void insertion_sort(long long vet[], int tam)
{
	int i, j;
	int x;
	
	for(i=1; i<tam; i++) {
		x = vet[i];
		j = i-1;
		while(j >= 0 && x < vet[j]) {
			vet[j+1] = vet[j];
			j--;
		}
		vet[j+1] = x;
	}
}
